Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
981	More Efficient Algorithms for Closest String and Substring Problems Bin Ma1 and Xiaoming Sun2 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2008-03-04 00:32:19 Complexity classes Analysis of algorithms NP-complete problems Approximation algorithms Closest string Polynomial-time approximation scheme Parameterized complexity Time complexity String Theoretical computer science Computational complexity theory Applied mathematics
982	Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication William Hesse1 Add to Reading List Source URL: ftp.cs.rutgers.edu Language: English - Date: 2002-06-10 12:16:49 Circuit complexity FO ACC0 AC0 DLOGTIME BIT predicate Computational complexity theory AC TC0 Theoretical computer science Applied mathematics Complexity classes
983	C:/__FAENA__/_RESEARCH/_SUBMISSIONS/2000/Beyond/More/Beyond2 - PUBLISHED/sent/TT-JHdz2.dvi Add to Reading List Source URL: users.dsic.upv.es Language: English - Date: 2012-10-21 07:07:02 Computability theory Complexity classes Algorithmic information theory Turing machine Alan Turing Kolmogorov complexity Universal Turing machine Inductive inference Minimum description length Theoretical computer science Applied mathematics Computational complexity theory
984	LinearProgram SlId NewAlor Many people think that abstract mathematics is a nightmare. In truth, it is a Add to Reading List Source URL: www.stolaf.edu Language: English - Date: 2013-03-22 09:46:09 Operations research Complexity classes Mathematical optimization Linear programming Algorithm NP-complete Simplex algorithm Simplex NP Theoretical computer science Applied mathematics Computational complexity theory
985	P , NP and mathematics – a computational complexity perspective Avi Wigderson Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2012-04-18 10:58:44 Complexity classes P versus NP problem Co-NP NP P Decision problem Time complexity Reduction NP-complete Theoretical computer science Computational complexity theory Applied mathematics
986	JOURNAL OF COMPUTER Add to Reading List Source URL: www.igi.tugraz.at Language: English - Date: 2013-12-10 07:35:33 Complexity classes Circuit complexity ACC0 NC PP Circuit FO Boolean circuit P Theoretical computer science Computational complexity theory Applied mathematics
987	Algorithms and Complexity Herbert S. Wilf Add to Reading List Source URL: www.math.upenn.edu Language: English - Date: 2004-04-28 15:32:06 Analysis of algorithms Complexity classes Mathematical optimization Time complexity NP Algorithm Big O notation P Fast Fourier transform Theoretical computer science Applied mathematics Computational complexity theory
988	How to Run Turing Machines on Encrypted Data Shafi Goldwasser⋆ Yael Kalai† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-06-09 00:24:22 Turing machine Computability theory Models of computation Alan Turing Homomorphic encryption Computability Advice NTIME EXPTIME Theoretical computer science Applied mathematics Complexity classes
989	i Computational Complexity: A Modern Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2007-01-08 22:01:30 Complexity classes Probabilistic complexity theory Analysis of algorithms Quantum complexity theory Bounded-error probabilistic polynomial PP Randomized algorithm Probabilistic Turing machine Time complexity Theoretical computer science Computational complexity theory Applied mathematics
990	Part 2: Results from the States Add to Reading List Source URL: completecollege.org Language: English - Date: 2011-10-06 15:39:00 Complexity classes NP

UPDATE